Multimodal Dependent Type Theory

نویسندگان

چکیده

We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by mode specifies collection of modes, modalities, and transformations between them. show that different choices allow us to use the same compute reason in many modal situations, including guarded recursion, axiomatic cohesion, parametric quantification. reproduce examples from prior work recursion thereby demonstrating constitutes simple usable syntax whose instantiations intuitively correspond previous handcrafted theories. In some cases, instantiating particular situation unearths previously unknown improves upon systems. Finally, we investigate metatheory MTT. prove consistency establish canonicity through an extension recent type-theoretic gluing techniques. These results hold irrespective choice theory, thus apply wide variety situations.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantified Multimodal Logics in Simple Type Theory

We present a straightforward embedding of quantified multimodal logic in simple type theory and prove its soundness and completeness. Modal operators are replaced by quantification over a type of possible worlds. We present simple experiments, using existing higher-order theorem provers, to demonstrate that the embedding allows automated proofs of statements in these logics, as well as meta pro...

متن کامل

A dependent nominal type theory

Nominal abstract syntax is an approach to representing names and binding pioneered by Gabbay and Pitts. So far nominal techniques have mostly been studied using classical logic or model theory, not type theory. Nominal extensions to simple, dependent and ML-like polymorphic languages have been studied, but decidability and normalization results have only been established for simple nominal type...

متن کامل

Elaboration in Dependent Type Theory

To be usable in practice, interactive theorem provers need to provide convenient and efficient means of writing expressions, definitions, and proofs. This involves inferring information that is often left implicit in an ordinary mathematical text, and resolving ambiguities in mathematical expressions. We refer to the process of passing from a quasi-formal and partially-specified expression to a...

متن کامل

Dependent Communication in Type Theory

We present an expressive type system for a language extending the usual λ-calculus with concurrency primitives from the π-calculus. This language uses dependent types as found in type theory, enriched with linear types for processes. It allows to define programs performing communication according to complex protocols, including possible dependencies on the communicated data. The core of this ty...

متن کامل

Automation for Dependent Type Theory

Hammers provide most powerful general purpose automation for proof assistants based on HOL and set theory today. Despite the gaining popularity of the more advanced versions of type theory, such as those based on the Calculus of Inductive Constructions, the construction of hammers for such foundations has been hindered so far by the lack of translation and reconstruction components. In this pap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logical Methods in Computer Science

سال: 2021

ISSN: ['1860-5974']

DOI: https://doi.org/10.46298/lmcs-17(3:11)2021